A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems
نویسندگان
چکیده
منابع مشابه
Benchmarking ordering techniques for nonserial dynamic programming
Five ordering algorithms for the nonserial dynamic programming algorithm for solving sparse discrete optimization problems are compared in this paper. The benchmarking reveals that the ordering of the variables has a significant impact on the run-time of these algorithms. In addition, it is shown that different orderings are most effective for different classes of problems. Finally, it is shown...
متن کاملPostoptimal Analysis in Nonserial Dynamic Programming
Usually, discrete optimization problems (DOPs) from applications have a special structure, and the matrices of constraints for largescale problems have a lot of zero elements (sparse matrices). One of the promising ways to exploit sparsity in the interaction graph of the DOP is nonserial dynamic programming (NSDP), which allows to compute a solution in stages such that each of them uses results...
متن کاملNonserial dynamic programming and local decomposition algorithms in discrete programming
One of perspective ways to exploit sparsity in the dependency graph of an optimization problem is nonserial dynamic programming (NSDP) which allows to compute solution in stages, each of them uses results from previous stages. The class of discrete optimization problems with the block-tree matrix of constraints is considered. Nonserial dynamic programming (NSDP) algorithm for the solution of th...
متن کاملNonserial Dynamic Programming and Tree Decomposition in Discrete Optimization
Solving discrete optimization problems (DOP) can be a rather hard task. Many real DOPs contain a huge number of variables and/or constraints that make the models intractable for currently available solvers. There are few approaches for solving DOPs: tree search approaches (e.g., branch and bound), relaxation and decomposition methods. Large DOPs can be solved due to their special structure. Amo...
متن کاملHigh-Level vs Low-Level Parallel Programming for Scientific Computing
This talk briefly reviews some of the most popular high-level and low-level parallel programming languages used for scientific computing. We will report our experiences of using these languages in our research and compare the performance of several parallel scientific equation solvers implemented in different parallel languages. Major features and comparisons of these languages will be discusse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1986
ISSN: 0898-1221
DOI: 10.1016/0898-1221(86)90057-x